A Novel Divisional Bisection Method for the Symmetric Tridiagonal Eigenvalue Problem

The embarrassingly parallel nature of the Bisection Algorithm makes it easy and efficient to program on a computer, but with an expensive time cost when all symmetric tridiagonal eigenvalues are wanted. In addition, few methods can calculate single eigenvalue in for now, especially specific order. This paper solves issue new approach that parallelize iteration. Some pseudocodes numerical results presented. It shows our algorithm reduces by more than 35–70% compared while maintaining its accuracy flexibility.